Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres

نویسندگان

  • Louis J. Billera
  • Samuel K. Hsiao
  • J. Scott Provan
چکیده

We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The complete information on the numbers of faces and chains of faces in these spheres can be obtained from the defining lattices in a manner analogous to the relation between arrangements of hyperplanes and their underlying geometric intersection lattices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oriented Interval Greedoids

We propose a definition of an oriented interval greedoid that simultaneously generalizes the notion of an oriented matroid and the construction on antimatroids introduced by L. J. Billera, S. K. Hsiao, and J. S. Provan in Enumeration in convex geometries and associated polytopal subdivisions of spheres [Discrete Comput. Geom. 39 (2008), no. 1-3, 123–137]. As for of oriented matroids, associated...

متن کامل

Crofton Measures in Polytopal Hilbert Geometries

The Hilbert geometry in an open bounded convex set in R is a classical example of a projective Finsler space. We construct explicitly a positive measure on the space of lines in a polytopal Hilbert geometry which yields an integral geometric representation of Crofton type for the Holmes-Thompson area of hypersurfaces. MSC 2000: 53C60 (primary); 53C65, 52B11 (secondary)

متن کامل

On Polytopal Upper Bound Spheres

Generalizing a result (the case k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k+1 belongs to the generalizedWalkup class Kk(2k + 1), i.e., all its vertex links are k-stacked spheres. This is surprising since the k-stacked spheres minimize the face-vector (among all polytopal spheres with given f0, . . . , fk−1) while the upper bound spheres maximize...

متن کامل

Fiber Polytopes for the Projections between Cyclic Polytopes

The cyclic polytope C(n, d) is the convex hull of any n points on the moment curve {(t, t2, . . . , td ) : t ∈ R} in Rd . For d ′ > d , we consider the fiber polytope (in the sense of Billera and Sturmfels [6]) associated to the natural projection of cyclic polytopes π : C(n, d ) → C(n, d) which ‘forgets’ the last d ′ − d coordinates. It is known that this fiber polytope has face lattice indexe...

متن کامل

How to Make a Triangulation of S Polytopal

We introduce a numerical isomorphism invariant p(T ) for any triangulation T of S3. Although its definition is purely topological (inspired by the bridge number of knots), p(T ) reflects the geometric properties of T . Specifically, if T is polytopal or shellable, then p(T ) is “small” in the sense that we obtain a linear upper bound for p(T ) in the number n = n(T ) of tetrahedra of T . Conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2008